Efficient Representative Subset Selection over Sliding Windows
نویسندگان
چکیده
منابع مشابه
Efficient Summing over Sliding Windows
This paper considers the problem of maintaining statistic aggregates over the last W elements of a data stream. First, the problem of counting the number of 1’s in the last W bits of a binary stream is considered. A lower bound of Ω( 1 +logW ) memory bits forW -additive approximations is derived. This is followed by an algorithm whose memory consumption is O( 1 + logW ) bits, indicating that th...
متن کاملQuerying languages over sliding windows
We study the space complexity of querying languages over data streams in the sliding window model. The algorithm has to answer at any point of time whether the content of the sliding window belongs to a fixed regular language. For regular languages, a trichotomy is shown: For every regular language the optimal space requirement is asymptotically either constant, logarithmic, or linear in the si...
متن کاملSubmodular Maximization over Sliding Windows
In this paper we study the extraction of representative elements in the data stream model in the form of submodular maximization. Different from the previous work on streaming submodular maximization, we are interested only in the recent data, and study the maximization problem over sliding windows. We provide a general reduction from the sliding window model to the standard streaming model, an...
متن کاملSubmodular Optimization Over Sliding Windows
Maximizing submodular functions under cardinality constraints lies at the core of numerous data mining and machine learning applications, including data diversification, data summarization, and coverage problems. In this work, we study this question in the context of data streams, where elements arrive one at a time, and we want to design lowmemory and fast update-time algorithms that maintain ...
متن کاملGeometric Optimization Problems Over Sliding Windows
We study the problem of maintaining a (1+2)-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple algorithm that only needs to store O( 1 2 logR) points at any time, where the parameter R denotes the “spread” of the point set. This bound is optimal and improves Feigenbaum, Kannan, and Zhang’s recent solution by two logarith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2019
ISSN: 1041-4347,1558-2191,2326-3865
DOI: 10.1109/tkde.2018.2854182